Dual-tree-based multicasting on wormhole-routed irregular switch-based networks

In this paper, we will address a dual-tree-based routing model and propose an efficient dual-treebased multicasting algorithm with three destination-switch partition strategies on irregular switch-based networks. The dual-tree-based routing scheme supports adaptive, distributed, and deadlock-free multicast on switch-based networks with double channels. We first describe a dual-tree structure established, based on the concept of network partitioning, from the irregular networks and prove that the multicasting based on this structure is deadlock-free. Then, an efficient multicast routing algorithm with three destination-switch partition strategies: random partition, label-ordered partition, and optimum level-based partition, is proposed. Finally, the experimental results are given to show that the multicast performance based on tree-based multicasting scheme can be promoted by the dual-tree-based multicasting scheme with label-ordered or optimum level-based destination-switch partition strategies. In general, the dual-tree-based multicasting scheme with optimum level-based partition is the best for all situations.